Hamiltonian cycles in cubic Cayley graphs: the 〈2,4k,3〉 case
نویسندگان
چکیده
It was proved by Glover and Marušič (J. Eur. Math. Soc. 9:775–787, 2007), that cubic Cayley graphs arising from groups G = 〈a, x | a2 = x = (ax)3 = 1, . . .〉 having a (2, s,3)-presentation, that is, from groups generated by an involution a and an element x of order s such that their product ax has order 3, have a Hamiltonian cycle when |G| (and thus also s) is congruent to 2 modulo 4, and have a Hamiltonian path when |G| is congruent to 0 modulo 4. In this article the existence of a Hamiltonian cycle is proved when apart from |G| also s is congruent to 0 modulo 4, thus leaving |G| congruent to 0 modulo 4 with s either odd or congruent to 2 modulo 4 as the only remaining cases to be dealt with in order to establish existence of Hamiltonian cycles for this particular class of cubic Cayley graphs.
منابع مشابه
Heuristic search for Hamilton cycles in cubic graphs
A successful heuristic algorithm for nding Hamilton cycles in cubic graphs is described Several graphs from The Foster census of connected symmetric trivalent graphs and all cubic Cayley graphs of the group PSL are shown to be hamiltonian Proposed running head HAMILTON CYCLES IN CUBIC GRAPHS
متن کاملCayley graph associated to a semihypergroup
The purpose of this paper is the study of Cayley graph associated to a semihypergroup(or hypergroup). In this regards first we associate a Cayley graph to every semihypergroup and then we study theproperties of this graph, such as Hamiltonian cycles in this graph. Also, by some of examples we will illustrate the properties and behavior of these Cayley graphs, in particulars we show that ...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملFlows that are sums of hamiltonian cycles in Cayley graphs on abelian groups
If X is any connected Cayley graph on any finite abelian group, we determine precisely which flows on X can be written as a sum of hamiltonian cycles. (This answers a question of B. Alspach.) In particular, if the degree of X is at least 5, and X has an even number of vertices, then the flows that can be so written are precisely the even flows, that is, the flows f , such that ∑ α∈E(X) f(α) is ...
متن کاملFlows that are sums of hamiltonian cycles in abelian Cayley graphs
If X is any connected Cayley graph on any finite abelian group, we determine precisely which flows on X can be written as a sum of hamiltonian cycles. In particular, if the degree of X is at least 5, and X has an even number of vertices, then it is precisely the even flows, that is, the flows f , such that ∑ α∈E(X) f(α) is divisible by 2. On the other hand, there are infinitely many examples of...
متن کامل